Polynomial approximation―a new computational technique in dynamic programming: Allocation processes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modern Computational Applications of Dynamic Programming

Computational dynamic programming, while of some use for situations typically encountered in industrial and systems engineering, has proved to be of much greater significance in many areas of computer science. We review some of these applications here.

متن کامل

Techniques in Computational Stochastic Dynamic Programming

Excerpted Section A. MARKOV CHAIN APPROXIMATION Another approach to finite differences is the well developed Markov Chain Approximation (MCA) of Kushner [3, 4]. Recent developments are surveyed and further advanced by Kushner [5], and by Kushner and Dupuis [6], with special attention to methods for jump and reflected diffusions. This method applies a Markov chain approximation to continuous tim...

متن کامل

Dynamic Programming: A Computational Tool (Studies in Computational Intelligence)

This book provides a practical introduction to computationally solving discrete optimization problems using dynamic programming. From the examples presented, readers should more easily be able to There is capable to predict at state space agency. Text summarizes our system is calculated three columns. The dynamic programming method posm compares probabilities as this is slightly more efficient ...

متن کامل

Dynamic programming for computer register allocation

Scope and pur~s~computers and operations research admit to a rich and complex interface. Most examples of problem solving in this domain use both computers and operations research as tools to solve problems[I. 21. In particular, the computer is used as a tool in implementing a solution technique arising from an operations research model. A different aspect of this interface is explored here: op...

متن کامل

Optimal Asset Allocation using Adaptive Dynamic Programming

In recent years, the interest of investors has shifted to computerized asset allocation (portfolio management) to exploit the growing dynamics of the capital markets. In this paper, asset allocation is formalized as a Markovian Decision Problem which can be optimized by applying dynamic programming or reinforcement learning based algorithms. Using an artificial exchange rate, the asset allocati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1963

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1963-0160313-3